Pareto-efficient strategies in 2-person games in staircase-function continuous and finite spaces

A tractable method of solving noncooperative 2-person games in which strategies are staircase functions is suggested. The solution meant to be Pareto-efficient. considers any staircase-function game as a succession constants. For finite game, each constant-strategy bimatrix whose size sufficiently small solve it reasonable time. It proved that has single Pareto-efficient situation if every situation, and vice versa. Besides, that, whichever the continuity is, function-strategies stack successive situations games. If two or more situations, best efficient found by holding farthest from pair most unprofitable payoffs.